SAT Techniques and Knowledge Base Verification
نویسندگان
چکیده
Abstrract:For many application domains the best way to produce intelligent behavior is to encode knowledge about this domain to knowledge base. Verification of KB is one of the crucial issues in developing reliable knowledgebased systems. SAT techniques as resolution and DPLL can be used for verifying knowledge bases. We give a transformation of a DPLL refutation to a resolution refutation of a number of steps which is essentially less than the number of unit resolution steps applied in the DPLL refutation.
منابع مشابه
Using SAT Checkers to Solve The Logic Minimization Problem
We investigate new techniques for solving the two-level logic minimization problem: Given a Boolean function, find the smallest OR-of-ANDs expression that represents it. This is a problem of both theoretical and practical interest. It arises in several fields of Computer Science, such as digital design, reliability analysis and automated reasoning. This project explores a new approach that invo...
متن کاملRestoring Circuit Structure from SAT Instances
SAT solvers are now frequently used in formal verification, circuit test and other areas of EDA. In many such applications, SAT instances are derived from logic circuits. It is often assumed in the literature that circuit structure is lost when a conversion to CNF clauses is made [9]. We aim to examine this assumption. Specifically we formulate classes of combinational circuits that can be repr...
متن کاملSAT- and QBF-Based Reasoning Techniques
Propositional Satisfiability (SAT) and Quantified Boolean Formulas (QBFs) are the formalisms representative respectively of the complexity classes NP and PSPACE. Many problems in computer science, including formal verification and planning ones, can be naturally encoded in SAT and/or QBFs and then solved using state-of-the-art solvers. Further, these solvers can be naturally extended to deal wi...
متن کاملTowards Model Validation and Verification with SAT Techniques
After sketching how system development and the UML (Unified Modeling Language) and the OCL (Object Constraint Language) are related, validation and verification with the tool USE (UML-based Specification Environment) is demonstrated. As a more efficient alternative for verification tasks, two approaches using SAT-based techniques are put forward: First, a direct encoding of UML and OCL with Boo...
متن کاملA Generic Method for Theorem Proving based on Counting Satisfiability
Theorem proving is a challenging task for formal verification of systems. There exist many efforts to efficiently solve this problem, based for example on rewriting rules and/or SAT-based techniques. We propose an alternative of SAT-based techniques by using instead a counting SAT-based technique (denoted also #SAT). A SAT solver tests if a propositional formula F has at least one truth assignm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002